Interior Distance Using Barycentric Coordinates

نویسندگان

  • Raif M. Rustamov
  • Yaron Lipman
  • Thomas A. Funkhouser
چکیده

This paper introduces a framework for defining a shape-aware distance measure between any two points in the interior of a surface mesh. Our framework is based on embedding the surface mesh into a high-dimensional space in a way that best preserves boundary distances between vertices of the mesh, performing a mapping of the mesh volume into this high-dimensional space using barycentric coordinates, and defining the interior distance between any two points simply as their Euclidean distance in the embedding space. We investigate the theoretical properties of the interior distance in relation to properties of the chosen boundary distances and barycentric coordinates, and we investigate empirical properties of the interior distance using diffusion distance as the prescribed boundary distance and mean value coordinates. We prove theoretically that the interior distance is a metric, smooth, interpolating the boundary distances, and reproducing Euclidean distances, and we show empirically that it is insensitive to boundary noise and deformation and quick to compute. In case the barycentric coordinates are non-negative we also show a maximum principle exists. Finally, we use it to define a new geometric property, barycentroid of shape, and show that it captures the notion of semantic center of the shape.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Positive Gordon-Wixom coordinates

We introduce a new construction of transfinite barycentric coordinates for arbitrary closed sets in 2D. Our method extends weighted Gordon-Wixom interpolation to non-convex shapes and produces coordinates that are positive everywhere in the interior of the domain and that are smooth for shapes with smooth boundaries. We achieve these properties by using the distance to lines tangent to the boun...

متن کامل

Approximation of Circular Arcs Using Quartic Bezier Curves with Barycentric Coordinates Satisfying G Data

This paper proposes four methods to approximate circular arcs using quartic Bezier curves. Barycentric coordinates of two/three combination of control points are used to obtain an optimal approximation. Interior control points of quartic Bezier curves are found by satisfying G data from given circular arcs. The maximum errors between circular arcs and approximated curves are calculated using Ha...

متن کامل

Volume-preserving deformation using generalized barycentric coordinates

The cage-based deformation of a 3D object through generalized barycentric coordinates is a simple, e cient, e ective and hence widely used shape manipulation scheme. Editing vertices of the polyhedral cage induces a smooth space deformation of its interior; the vertices thus become control handles of the nal deformation. However, in some application elds, as medicine, constrained volumepreservi...

متن کامل

Lattice point simplices

We consider simplices in [w” with lattice point vertices, no other boundary lattice points and n interior lattice points, with an emphasis on the barycentric coordinates of the interior points. We completely classify such triangles under unimodular equivalence and enumerate. For example, in a lattice point triangle with exactly one interior point, that point must be the centroid. We discuss the...

متن کامل

Biharmonic Coordinates

Barycentric coordinates are an established mathematical tool in computer graphics and geometry processing, providing a convenient way of interpolating scalar or vector data from the boundary of a planar domain to its interior. Many different recipes for barycentric coordinates exist, some offering the convenience of a closedform expression, some providing other desirable properties at the expen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Comput. Graph. Forum

دوره 28  شماره 

صفحات  -

تاریخ انتشار 2009